Contractible Non-edges in 3-Connected Graphs
نویسندگان
چکیده
منابع مشابه
Contractible edges in 3-connected graphs
By a graph, we mean a finite undirected simple graph with no loops and no multiple edges. For a graph G and an edge e of G, we let G/e denote the graph obtained from G by contracting e (and replacing each pair of the resulting double edges by a simple edge). Let k ≥ 2 be an integer, and let G be a k-connected graph. An edge e of G is said to be k-contractible if G/e is k-connected. The set of k...
متن کاملOn contractible edges in 3-connected graphs
The existence of contractible edges is a very useful tool in graph theory. For 3-connected graphs with at least six vertices, Ota and Saito (1988) prove that the set of contractible edges cannot be covered by two vertices. Saito (1990) prove that if a three-element vertex set S covers all contractible edges of a 3-connected graph G, then S is a vertex-cut of G provided that G has at least eight...
متن کاملMaximum matchings in 3-connected graphs contain contractible edges
In this paper it is shovm that every maximum matching in a 3-connectccl graph, other than ](4, contains at least one contractible edge. In the case of a. perfect ma.tching, those graphs in \vhich there exists a perfect matching containing precisely one contractible edge arc characterized.
متن کاملOn Hamilton cycles and contractible edges in 3-connected graphs
by R. E. L. Aldred1 University of Otago New Zealand
متن کاملContractible edges in minimally k-connected graphs
An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K1 + C4)-free minimally k-connected graph has a k-contractible edge, if incident to each vertex of degree k, there is an edge which is not contained in a triangle. This implies two previous results, one due to Thomassen and the other due to K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1998
ISSN: 0095-8956
DOI: 10.1006/jctb.1998.1842